Computing optimal discrete readout weights in reservoir computing is NP-hard
نویسندگان
چکیده
منابع مشابه
Computing a Minimum-Dilation Spanning Tree is NP-hard
Given a set S of n points in the plane, a minimumdilation spanning tree of S is a tree with vertex set S of smallest possible dilation. We show that given a set S of n points and a dilation δ > 1, it is NP-hard to determine whether a spanning tree of S with dilation at most δ exists.
متن کاملComputing Geometric Minimum-Dilation Graphs Is NP-Hard
We prove that computing a geometric minimum-dilation graph on a given set of points in the plane, using not more than a given number of edges, is an NP-hard problem, no matter if edge crossings are allowed or forbidden. We also show that the problem remains NP-hard even when a minimum-dilation tour or path is sought; not even an FPTAS exists in this case.
متن کاملComputing the maximum matching width is NP-hard
The maximum matching width is a graph width parameter that is defined on a branchdecomposition over the vertex set of a graph. In this short paper, we prove that the problem of computing the maximum matching width is NP-hard.
متن کاملComputing the discrete Fréchet distance upper bound of imprecise input is NP-hard
The Fréchet distance is a natural measure of similarity between two curves [4]. The Fréchet distance between two curves is often referred to as the “dog-leash distance”. Alt and Godau [4] presented an algorithm to compute the Fréchet distance between two polygonal curves of n and m vertices in O(nm log(nm)) time. There has been a lot of applications using the Fréchet distance to do pattern/curv...
متن کاملIs optimal solution of every NP-complete or NP-hard problem determined from its characteristic for DNA-based computing.
Cook's Theorem [Cormen, T.H., Leiserson, C.E., Rivest, R.L., 2001. Introduction to Algorithms, second ed., The MIT Press; Garey, M.R., Johnson, D.S., 1979. Computer and Intractability, Freeman, San Fransico, CA] is that if one algorithm for an NP-complete or an NP-hard problem will be developed, then other problems will be solved by means of reduction to that problem. Cook's Theorem has been de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neurocomputing
سال: 2019
ISSN: 0925-2312
DOI: 10.1016/j.neucom.2019.02.009